Al-Sijistani's and Maimonides's Double Negation Theology Explained by Constructive Logic
نویسندگان
چکیده
Famous medieval philosophers Al-Sijistani and Maimonides argued that the use of double negation helps us to better understand issues related to theology. To a modern reader, however, their arguments are somewhat obscure and unclear. We show that these arguments can be drastically clarified if we take into account the 20 century use of double negation in constructive logic. 1 Double Negation Theology: A Brief Reminder What is double negation theology. Abu Yakub Al-Sijistani (d. 971) and Moses ibn Maimon (1135–1204), also known as Maimonides, claimed that while while God is essentially incomprehensible, it is possible to gain some knowledge of God by using double negation; see, e.g., [15, 19]. For example, one cannot say that God is good, but it make sense to say that God is not not-good. Why double negation? The reasoning behind the use of double negation is, to a modern reader, rather obscure and unclear. In this short paper, we will show, however, that the use of double negation can be made much clearer to the modern reader if we take into account the 20 century developments in constructive logic. 2 What Is Constructive Logic: A Reminder Constructivity in mathematics before the 20 century. Strictly speaking, mathematics is about proving results. However, from the ancient times, mathematicians were also interested in constructing objects. The need for constructions is motivated largely by applications. For example, to predict where a satellite will be at some future moment of time, we need to
منابع مشابه
On the Semantics of Classical First-order Logic with Constructive Double Negation
Constructive negation in intuitionistic logic (called strong negation [7]) can be used to directly represent negative assertions, and for which its semantics [8, 1] is defined in Kripke models by two satisfaction relations (|= P and |= N ). However, the interpretation and satisfaction based on the conventional semantics do not fit in with the definition of negation in knowledge representation w...
متن کاملNegation and Constraint Logic Programming
Almost all constraint logic programming systems include negation, yet nowhere has a sound operational model for negation in CLP been discussed. The SLDNF approach of only allowing ground negative subgoals to execute is very restrictive in constraint logic programming where most variables appearing in a derivation never become ground. By describing a scheme for constructive negation in constrain...
متن کاملConsistent Positive and Linear Positive Quasi-antiorders
This investigation, in Bishop’s constructive mathematics in sense of well-known books [2], [3], [6] and Romano’s papers [9]-[15], is continuation of forthcoming Crvenkovic, Mitrovic and Romano’s paper [4], and the Romano’s paper [16]. Bishop’s constructive mathematics is developed on Constructive logic (or Intuitionistic logic ([19])) logic without the Law of Excluded Middle P ∨¬¬P . Let us not...
متن کاملNegation in Logic Programming: A Formalization in Constructive Logic
The conventional formalization of logic programming in classical logic explains very convincingly the basic principles of this programming style. However, it gives no easy or intuitive explanations for the treatment of negation. Logic Programming handles negation through the so-called ^Negation as Failure" inference principle which is rather unconventional from the viewpoint of classical logic....
متن کاملSlaney’s Logic F∗∗ Is Constructive Logic with Strong Negation
In [19] Slaney et al. introduced a little known deductive system F∗∗ in connection with the problem of the indeterminacy of future contingents. The main result of this paper shows that, up to definitional equivalence, F∗∗ has a familiar description: it is precisely Nelson’s constructive logic with strong negation [25].
متن کامل